Bounds on Shared Memory for Mutual Exclusion
نویسندگان
چکیده
منابع مشابه
Time Complexity Bounds for Shared-memory Mutual Exclusion
YONG-JIK KIM: Time Complexity Bounds for Shared-memory Mutual Exclusion. (Under the direction of James H. Anderson.) Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic” problems in concurrent programming. Recent work on scalable shared-memory mutual...
متن کاملTight RMR Lower Bounds for Mutual Exclusion
We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, h...
متن کاملTitle of Dissertation: Scalable Synchronization in Shared Memory Multiprocessing Systems Scalable Synchronization in Shared Memory Multiprocessing Systems
Title of Dissertation: Scalable Synchronization in Shared Memory Multiprocessing Systems Jae-Heon Yang, Doctor of Philosophy, 1994 Dissertation directed by: Assistant Professor James H. Anderson Department of Computer Science It is our thesis that scalable synchronization can be achieved with only minimal hardware support, speci cally read/write atomicity. This is contrary to the conventional v...
متن کاملTime Bounds for Mutual Exclusion and Related Problems ( Extended
We establish trade-o s between time complexity and writeand access-contention for solutions to the mutual exclusion problem. The write-contention (accesscontention) of a concurrent program is the number of processes that may be simultaneously enabled to write (access) the same shared variable. Our notion of time complexity distinguishes between local and remote references to shared memory. We s...
متن کاملTime/Contention Trade-o s for Multiprocessor Synchronization
We establish trade-o s between time complexity and writeand access-contention for solutions to the mutual exclusion problem. The write-contention (access-contention) of a concurrent program is the number of processes that may be simultaneously enabled to write (access by reading and/or writing) the same shared variable. Our notion of time complexity distinguishes between local and remote access...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 107 شماره
صفحات -
تاریخ انتشار 1993